An FPTAS for the Subset Sum Problem Margarida Mamede, DI – FCT/UNL

Source URL: orium.pw

The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

Source URL: ciim.usf.edu

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Source URL: web.stanford.edu

• Mathematics
• Search algorithms
• Information retrieval
• Information science
• Hashing
• Analysis of algorithms
• Cryptographic hash functions
• Computational complexity theory
• Universal hashing
• Hash function
• Randomized algorithm
• Subset sum problem

Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Quantum algorithms for the subset-sum problem D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with:

Source URL: pqcrypto2013.xlim.fr

SQUARES IN SUMSETS HOI H. NGUYEN AND VAN H. VU Abstract. A finite set A of integers is square-sum-free if there is no subset of A sums up to a square. In 1986, Erd˝ os posed the problem of determining the

Source URL: people.math.osu.edu

Erratum to “Approximability of the Subset Sum Reconfiguration Problem⋆ ” Takehiro Ito1 and Erik D. Demaine2 1 2

Source URL: www.ecei.tohoku.ac.jp

The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem ? (Extended Abstract) Vadim Lyubashevsky University of California at San Diego, La Jolla CA 92093, USA

Source URL: www.di.ens.fr

Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team

Source URL: doc.sagemath.org

• Operations research
• Dynamic programming
• Cryptography
• Combinatorial optimization
• Knapsack problem
• Subset sum problem
• Sequence
• Exponentiation
• Linear programming
• Mathematics
• Theoretical computer science
• Computational complexity theory

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003

Source URL: www.cs.berkeley.edu

• NP-complete problems
• Complexity classes
• Bin packing problem
• NP
• Subset sum problem
• Partition problem
• Vertex cover
• Integer
• 3-partition problem
• Theoretical computer science
• Mathematics
• Computational complexity theory